Resource constrained scheduling as generalized bin packing
نویسندگان
چکیده
منابع مشابه
Tight Approximations for Resource Constrained Scheduling and Bin Packing
We consider the following l'esource constrained scheduling problem. Given 111. identical processors, S l'esourccs with upper hounds, 11, independent tasks of unit length l where each task has astart tüne and requires Olle processor and a task-dependeni amount of every resourcc. The optimization problem i8 1,0 schedule all tasks at dis~ crete tilncs in 1N J minilnizing the latest c.ompletion tim...
متن کاملGeneralized selfish bin packing
Standard bin packing is the problem of partitioning a set of items with positive sizes no larger than 1 into a minimum number of subsets (called bins) each having a total size of at most 1. In bin packing games, an item has a positive weight, and given a valid packing or partition of the items, each item has a cost or a payoff associated with it. We study a class of bin packing games where the ...
متن کاملGeneralized Bin Packing Problems
Original Citation: Baldi M.M. Generalized Bin Packing Problems. In: 4OR. ISSN 1619-4500 (In Press) Availability: This version is available at : http://porto.polito.it/2523486/ since: December 2013 Publisher: Springer Published version: DOI:10.1007/s10288-013-0252-1 Terms of use: This article is made available under terms and conditions applicable to Open Access Policy Article ("Public All right...
متن کاملClass constrained bin packing revisited
We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer parameter k, and the goal is to partition the items into a minimum number of subsets such that for each subset S in the solution, the total size of the items in S is at most 1 (as in the classical bin packing problem) and the...
متن کاملTight Approximations for Resource Constrained Scheduling and Bin
We consider the following resource constrained scheduling problem. Given m identical processors, s resources with upper bounds, n independent tasks of unit length, where each task has a start time and requires one processor and a task-dependent amount of every resource. The optimization problem is to schedule all tasks at discrete times in II N, minimizing the latest completion time Cmax subjec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1976
ISSN: 0097-3165
DOI: 10.1016/0097-3165(76)90001-7